منابع مشابه
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasi-boolean multi-valued logics for reasoning about such systems. We also give semantics to a multi-valued extension of CTL, descr...
متن کاملIssues on adjointness in multiple-valued logics
We contribute to the theory of implications and conjunctions related by adjointness, in multiple-valued logics. We suggest their use in Zadeh s compositional rule of inference, to interpret generalized modus ponens inference schemata. We provide new complete characterizations of implications that distinguish left arguments, implications that satisfy the exchange principle, divisible conjunction...
متن کاملAnalogical Proportions and Multiple-Valued Logics
Recently, a propositional logic modeling of analogical proportions, i.e., statements of the form “A is to B as C is to D”, has been proposed, and has then led to introduce new related proportions in a general setting. This framework is well-suited for analogical reasoning and classification tasks about situations described by means of Boolean properties. There is a clear need for extending this...
متن کاملRestricted ∆-trees in Multiple-Valued Logics
This paper generalises the tree-based data structure of ∆tree to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. The conversions from signed formulas to ∆-trees and vice...
متن کاملExploiting Data Dependencies in Many-Valued Logics
The purpose of this paper is to make some practically relevant results in automated theorem proving available to many-valued logics with suitable modifications. We are working with a notion of many-valued first-order clauses which any finitely-valued logic formula can be translated into and that has been used several times in the literature, but in an ad hoc way. We give a many-valued version o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90119-3